Algebraic dependencies

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic aspects of attribute dependencies

We exhibit some new connections between structure of an information system and its corresponding semilattice of equivalence relations. In particular, we investigate dependency properties and introduce a partial ordering of information systems over a fixed object set U which reflects the sub–semilattice relation on the set of all equivalence relations on U.

متن کامل

Integer Factoring Using Small Algebraic Dependencies

Integer factoring is a curious number theory problem with wide applications in complexity and cryptography. The best known algorithm to factor a number n takes time, roughly, exp(2 log1/3 n· log2/3 logn) (number field sieve, 1989). One basic idea used is to find two squares, possibly in a number field, that are congruent modulo n. Several variants of this idea have been utilized to get other fa...

متن کامل

Learning Nonadjacent Dependencies 1 Learning Nonadjacent Dependencies: No Need for Algebraic-like Computations

Is it possible to learn the relation between two events, A and C, when they are separated by a variable event, X? Peña, Bonatti, Nespor, and Mehler (2002) claimed that such learning can be established, and even remarkably rapidly, but only when subliminal 25 ms pauses are inserted between the AXC units of an imaginary language. They interpreted their results as proof that learning nonadjacent d...

متن کامل

Optimal Controller for Stochastic Systems with Algebraic Dependencies

For systems with algebraic dependencies an extended design of an optimal controller is discussed. It relies on a new notion of a sequential controller proposed together with an efficient algorithm for determining a set of admissible controllers to a given system that contain the least number of delays. An extended optimizing recursion then follows naturally. Copyright c © 2005 IFAC

متن کامل

Algebraic Combinators for Data Dependencies and Their Applications

The notion of Data Dependency Algebra (DDA) is an algebraic formalism that turns data dependencies into first class citizens in the program code through a dedicated Application Programming Interface (API). This forms the basis of a platform independent parallel programming model [BH09]. In this paper, we further expand the theory of DDAs by proposing algebraic combinators operating on top of DD...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computer and System Sciences

سال: 1982

ISSN: 0022-0000

DOI: 10.1016/0022-0000(82)90008-3